Approximation of catmull-clark subdivision surfaces by bezier patches

ABSTRACT

A method for converting a subdivision surface, such as a Catmull-Clark subdivision surface, into a cubic Bezier surface defined by sixteen control points. The method includes (a) converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and (b) replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point&#39;s limit point.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention is directed to approximating a Catmull Clark subdivision surface by Bezier patches.

[0003] 2. Description of the Related Art

[0004] Subdivision surfaces are a known computer graphics-modeling tool. Subdivision surfaces are powerful representations because they combine the best features of polygonal meshes (arbitrary topology) and NURBS surfaces (smoothness), in a mathematically elegant formulation. A subdivision surface base mesh is iteratively divided according to subdivision rules into a resultant limit surface, which is typically smooth. Catmull Clark is a widely used subdivision surface scheme which provides rules on how surfaces are subdivided. Subdivision surfaces, including Catmull Clark subdivision surfaces, can be found in commercial packages such as MAYA and SPEEDFORM. For an explanation of Catmull-Clark subdivision surfaces, please see the original paper by E. Catmull, J. Clark, “Recursively Generated B-Spline Surfaces on Arbitrary Topological Meshes,” in Computer Aided Design 10, 6 1978).

[0005] Subdivision surfaces are expensive to evaluate near extraordinary vertices, making them slow to tessellate and draw. Additionally, there are several mathematical calculations whose solutions are well known for polygons and NURBS, but are not that easily solved for subdivision surfaces. Such calculations include intersecting a ray and a surfaces, intersecting a plane and a surface, intersecting two surfaces, and finding a point on a surface closest to a given point.

[0006] Other representations, such as Bezier patches, can more easily solve the above matters. Thus, it can be desirable to convert a subdivision face into a cubic Bezier patch. A cubic Bezier patch is defined by 16 three-dimensional control points.

[0007] The prior art teaches how to convert from a uniform cubic B-spline curve segment into a Bezier representation, as described in the book, An Introduction to Splines for Use in Computer Modeling, Bartels, Beatty, Barsky, pgs. 243-245. Vertices from a subdivision face may be substituted into the equations described in Bartels to convert it to a Bezier representation. However, the Bartels method only works where all vertices in the subdivision face are regular. In other words, the vertices are all of valence four (defined as having exactly four edges) and are not part of a crease. One possible definition of a crease is where the tangent plane of a surface changes on one side of the crease compared to the other side of the crease.

[0008] The prior art does not teach a method for converting an irregular subdivision face.

SUMMARY OF THE INVENTION

[0009] It is an aspect of the present invention to provide a method, apparatus, and computer readable storage for converting or approximating a subdivision face into cubic Bezier surface.

[0010] The above aspects can be attained by a system that (a) converts a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and (b) replaces one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point.

[0011] These together with other aspects and advantages which will be subsequently apparent, reside in the details of construction and operation as more fully hereinafter described and claimed, reference being had to the accompanying drawings forming a part hereof, wherein like numerals refer to like parts throughout.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012]FIG. 1 is a flowchart illustrating a method of the present invention, according to an embodiment of the present invention;

[0013]FIG. 2 is a drawing illustrating subdivision faces, according to an embodiment of the present invention;

[0014]FIG. 3 is a drawing illustrating a subdivision face with a valence of three, according to an embodiment of the present invention;

[0015]FIG. 4 is a drawing illustrating a subdivision face with a valence greater than four, according to an embodiment of the present invention;

[0016]FIG. 5 is a drawing illustrating a subdivision face, the subdivision face's resulting limit surface, and the face's converted Bezier patch, according to an embodiment of the present invention;

[0017]FIG. 6 is a drawing illustrating adjusting of a control vertex, according to an embodiment of the present invention; and

[0018]FIG. 7 is a block diagram illustrating one example of hardware used to implement the present invention, according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0019] The present invention allows conversion of a subdivision surface, such as a Catmull-Clark subdivision surface, into a cubic Bezier surface defined by sixteen control points. The present invention allows for conversion of a subdivision surface containing either an extraordinary point or a creased edge.

[0020]FIG. 1 is a flowchart illustrating a method of the present invention, according to an embodiment of the present invention.

[0021] The method assigns 100 a dummy value to a phantom point. A phantom point is a point that is needed in the conversion matrix but is not really known. Since this value is not known, a dummy value (such as 0,0,0) is used. This operation is performed so that the conversion matrix (described in more detail below) can be used even though a value is not known. This operation will be described below in more detail.

[0022] The method then converts 102 the sixteen points which define the subdivision face (including the dummy value) using a conversion matrix into a cubic Bezier surface. However, since a dummy value was used for the phantom point, some of the resulting sixteen control points which define a cubic Bezier surface are not accurate (see the matrix formulas below). This operation will be described below in more detail.

[0023] The method then replaces 104 an appropriate Bezier control point with the subdivision surface limit point. This is done because using the phantom point in the matrix will cause a corresponding Bezier control point to be inaccurate. It is fixed by thus replacing it with the subdivision surface limit point. This operation will be described in more detail below.

[0024] The method then adjusts 106 the remaining control point(s) which are inaccurate. This adjusting more closely approximates the newly calculated cubic Bezier surface to more closely match the resultant limit surface of the original subdivision surface face. This operation will be described in more detail below.

[0025] Thus, the general operations described above can convert a subdivision surface, such as a Catmull-Clark subdivision surface, into a cubic Bezier surface, even if a face of the subdivision surface contains either an extraordinary point or a creased edge. The general operations described above will be described below in more detail.

[0026]FIG. 2 is a drawing illustrating subdivision faces, according to an embodiment of the present invention.

[0027] Given a quadrilateral face f 200 of a Catmull-Clark subdivision surface, the following method generates sixteen control points that define a cubic Bezier surface approximating the face.

[0028] Assume that the control mesh of the subdivision surface is sufficiently subdivided so that every face is a quadrilateral, every face has at most one extraordinary vertex. Also assume sufficient subdivision to guarantee that in a face with creased edges, the creased edges are incident to the extraordinary vertex, if one exists. These assumptions ensure that the face can be rotated until the extraordinary vertex (if it exists) is the upper-left corner of the face and only the left edge e1 202 and upper edge 204 e2 may be creased.

[0029] Traverse the control mesh edges to find all the neighboring vertices of the four corner vertices. If all the vertices are regular (valence four), there are a total of sixteen control vertices in the neighborhood of face 200.

[0030]FIG. 3 is a drawing illustrating a subdivision face with a valence of three, according to an embodiment of the present invention. If the upper-left corner of face f 300 is an extraordinary vertex with valence three, label the fourteen vertices in the neighborhood as in FIG. 3, setting s₂₁=s₁₂ and assigning s₁₁=(0, 0, 0). Left edge e1 302 and upper edge e2 304 are also illustrated.

[0031]FIG. 4 is a drawing illustrating a subdivision face with a valence greater than four, according to an embodiment of the present invention. If the upper-left corner of face f 400 has valence greater than four, label the vertices in the neighborhood as in FIG. 4, assigning s₁₁=(0, 0, 0). Left edge e1 402 and upper edge e2 404 are also illustrated.

[0032] Arrange the sixteen control vertices s₁₁ through s₄₄ in a four-by-four matrix S: $S = \begin{bmatrix} s_{11} & s_{12} & s_{13} & s_{14} \\ s_{21} & s_{22} & s_{23} & s_{24} \\ s_{31} & s_{32} & s_{33} & s_{34} \\ s_{41} & s_{42} & s_{43} & s_{44} \end{bmatrix}$

[0033] Multiply S on the left by matrix M₁ and on the right by the transpose of matrix M₂ to convert spline control points to Bezier control points B:

B=M ₁ S(M₂)^(T)

[0034] Use M₁=M_(creased) if the left edge of the face is creased and M₁=M_(uncreased) otherwise. Similarly, use M₂=M_(creased) if the upper edge of the face is creased and M₂=M_(uncreased) otherwise. The matrix M_(uncreased) is the standard spline-to-Bezier conversion matrix: $M_{uncreased} = {\frac{1}{6}\begin{bmatrix} 1 & \quad & 4 & \quad & 1 & \quad & 0 \\ 0 & \quad & 4 & \quad & 2 & \quad & 0 \\ 0 & \quad & 2 & \quad & 4 & \quad & 0 \\ 0 & \quad & 1 & \quad & 4 & \quad & 1 \end{bmatrix}}$

[0035] The matrix M_(creased) is the same except for the first row: $M_{creased} = {\frac{1}{6}\begin{bmatrix} 0 & \quad & 6 & \quad & 0 & \quad & 0 \\ 0 & \quad & 4 & \quad & 2 & \quad & 0 \\ 0 & \quad & 2 & \quad & 4 & \quad & 0 \\ 0 & \quad & 1 & \quad & 4 & \quad & 1 \end{bmatrix}}$

[0036] If the upper-left corner of face f is an extraordinary vertex or is the endpoint of any creased edges, correct the upper-left Bezier control point b₁₁ by setting it to the subdivision surface limit point corresponding to the upper-left corner vertex of face f.

[0037] If the upper-left corner of face f is an extraordinary vertex with no incident crease edges, correct the Bezier control point b₂₁ as follows:

[0038] a) Calculate the partial derivative of the subdivision surface at the extraordinary point in the direction of edge e₁, using Stam's exact evaluation technique. (See Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values, Jos Stam, Proceedings of SIGGRAPH 98. pp. 395-404, 1998.) This gives a direction d₁ that is tangent to the surface at the extraordinary point, radiating in the direction of edge e₁ from the extraordinary point.

[0039] b) Calculate the limit point p₁ corresponding to the point halfway along edge e₁, again using Stam's exact evaluation technique. ‘c) Compute q₁=(8p₁−4b₁₁−3b₃₁b₄₁)/3.

[0040] d) Use the method of least squares to find the best solution x₁ to the three equations in one variable expressed by the system d₁x₁=q₁. The unique solution is given by x₁=(d₁·q₁)/(d₁·d₁).

[0041] e) Set b₂₁=b₁₁+d₁x₁. This construction forces the tangent direction along the edge of the Bezier surface to match the tangent direction d₁ along the edge of the subdivision surface face, while ensuring the edge of the Bezier surface comes as close as possible to passing through the point p₁.

[0042] If the upper-left corner of face f is an extraordinary vertex with no incident crease edges, correct the Bezier control point b₁₂ using the same technique describe above for the case if the upper-left corner of face f is an extraordinary vertex with no incident crease edges, but this time using edge e₂ and Bezier control points b₁₁, b₁₃, and b₁₄.

[0043] The surface approximating the original subdivision surface face is given by the standard formula for a cubic Bezier surface: ${a\left( {u,v} \right)} = {{\begin{bmatrix} \left( {1 - u} \right)^{3} \\ {3{u\left( {1 - u} \right)}^{2}} \\ {3{u^{2}\left( {1 - u} \right)}} \\ u^{3} \end{bmatrix}^{T}\begin{bmatrix} b_{11} & \quad & b_{12} & \quad & b_{13} & \quad & b_{14} \\ b_{21} & \quad & b_{22} & \quad & b_{23} & \quad & b_{24} \\ b_{31} & \quad & b_{32} & \quad & b_{33} & \quad & b_{34} \\ b_{41} & \quad & b_{42} & \quad & b_{43} & \quad & b_{44} \end{bmatrix}}\begin{bmatrix} \left( {1 - v} \right)^{3} \\ {3{v\left( {1 - v} \right)}^{2}} \\ {3{v^{2}\left( {1 - v} \right)}} \\ v^{3} \end{bmatrix}}$

[0044]FIG. 5 is a drawing illustrating a subdivision face, the subdivision face's resulting limit surface, and the face's converted Bezier patch, according to an embodiment of the present invention.

[0045] Subdivision face 500 has a limit surface 504. Control points b₁₁, b₁₂, b₁₃, b₁₄, b₂₃, b₂₄, b₃₁, b₃₂, b₃₃, b₃₄, b₄₁, b₄₂, b₄₃, b₄₄, define Bezier patch 504, after performing the conversion using the methods described above. Bezier patch 504 should closely match limit surface 504, although in FIG. 5 it may not appear this way so as to better illustrate the two surfaces.

[0046]FIG. 6 is a drawing illustrating adjusting of a control vertex, according to an embodiment of the present invention.

[0047] Bezier control points 600, 601, 604, and 606, are four side Bezier points (of the resulting sixteen points) after applying the conversion discussed above. Control points 600, 601, 604, 606, define Bezier surface 608, which is one side of the entire Bezier patch (the remaining sides are not pictured) defined by the sixteen control points that we have previously computed. Subdivision limit surface 610 is the limit surface of the original subdivision face. Note that the conversion to a Bezier patch is an approximation and thus Bezier surface 608 does not exactly match subdivision limit surface 610. The inaccuracy stems from using the dummy value in the matrix and substituting a subdivision limit point for an extraordinary point.

[0048] Control points 600 and 606 lie on the original subdivision limit surface 610. However, control points 601 and 604 typically do not. One (or more) of these points can be adjusted to improve the fit of the Bezier surface 608 with the subdivision limit surface 610.

[0049] Control point 601 can be adjusted to better match the Bezier surface 608 to the subdivision limit surface 610. To do this, a tangent ray 612 tangent to the limit surface 610 at the extraordinary point is calculated as described above. In this example the extraordinary point corresponds to control point 600, but of course in different situations the extraordinary point could be in a different position.

[0050] Bezier surface fit point 614 is identified. One possible way this can be done is to identify a point halfway on the Bezier surface 608, although any other criteria can be used. Subdivision limit surface fit point 616 is identified as a point halfway along the subdivision limit surface 610. This point can also be known as the mid parameter point.

[0051] Control point 601 is then replaced by sliding an adjusted point 602 along the tangent ray 612 so that the Bezier surface fit point 614 and the subdivision limit surface fit point 616 collide. One way this can be computed is performing a conventional least squares matrix calculation to match Bezier surface fit point 614 and subdivision limit surface fit point 616, given control points 600, 604, and 606, and tangent ray 612. Thus, Bezier control points 600, 602, 604, and 606 are the final results of our conversion. The adjusted Bezier surface (not illustrated) resulting from control points 600, 602, 604, and 606 results in a better fit than the original Bezier surface 608 (made from control points, 600, 601, 604, and 606).

[0052] While the above example applies to the left side of the Bezier patch, the same adjusting can be applied to the top side or any side of the Bezier patch affected by the approximations. If the extraordinary point falls on the upper left of the original subdivision face, then the left side and top side of the converted Bezier patch will need adjusting. Further, note that the points, lines, and surfaces illustrated in FIG. 6 are illustrated for clarity and generalization, but may not be mathematically exact.

[0053]FIG. 7 is a block diagram illustrating one example of hardware used to implement the present invention, according to an embodiment of the present invention.

[0054] Computer 706 contains a ROM 702, a RAM 704, and a disk drive 708. Computer 706 is also connected to a display monitor 700. Computer 706 is connected to a keyboard 712 and a mouse 714. Computer 706 can also be connected to such input devices as a tablet 710, which may include a pen 716 and a puck 718.

[0055] The present invention has been described with respect to converting a subdivision surface containing either an extraordinary point or a creased edge to a cubic Bezier surface.

[0056] The methods described above can all be performed manually by a person. The methods can also be performed by a computer program which can be stored on any type of computer readable storage medium, for example a CD-ROM. Further, the present invention provides for an apparatus (such as a digital computer) which is capable of executing a program which performs the methods herein.

[0057] The many features and advantages of the invention are apparent from the detailed specification and, thus, it is intended by the appended claims to cover all such features and advantages of the invention that fall within the true spirit and scope of the invention. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and operation illustrated and described, and accordingly all suitable modifications and equivalents may be resorted to, falling within the scope of the invention. 

What is claimed is:
 1. A method, comprising: converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point.
 2. A method as recited in claim 1, further comprising: adjusting affected Bezier control points which are affected by using the dummy value to better fit a Bezier patch defined by the Bezier control points with a limit surface of the subdivision face.
 3. A method as recited in claim 2, wherein an affected Bezier control point is adjusted by sliding the affected control point along a tangent of a respective limit side of the subdivision face.
 4. A method as recited in claim 3, wherein a location the affected Bezier control point is moved to is determined by using a least squares determination.
 5. A method as recited in claim 4, wherein the least squares determination computes a best solution for the affected control point, using three other control points defining the curve, to fit a point on the curve with a corresponding point on the limit surface of the subdivision face.
 6. A method as recited in claim 5, wherein the corresponding point is halfway along the curve.
 7. A method as recited in claim 1, wherein the subdivision face is formed using Catmull Clark subdivision rules.
 8. A method, comprising: converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point. adjusting affected Bezier control points which are affected by using the dummy value to better fit a Bezier patch defined by the Bezier control points with a limit surface of the subdivision face, wherein an affected Bezier control point is adjusted by sliding the affected control point along a tangent of a respective limit side of the subdivision face, wherein a location the affected Bezier control point is moved to is determined by using a least squares determination, wherein the least squares determination computes a best solution for the affected control point, using three other control points defining the curve, to fit a point on the curve with a corresponding point on the limit surface of the subdivision face, wherein the corresponding point is halfway along the curve, wherein the subdivision face is formed using Catmull Clark subdivision rules.
 9. A method, comprising: converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; calculating a tangent to a limit surface of the subdivision face at an extraordinary point; and moving an affected Bezier control point of the Bezier control points along the tangent to better fit a Bezier surface defined by the Bezier control points to the subdivision limit surface.
 10. A method for converting to a Bezier representation when an edge of a face is creased, comprising: converting a subdivision face to Bezier control points using a creased conversion matrix using sixteen points; and replacing one of the Bezier control points which corresponds to an endpoint of a creased edge of the subdivision face with the endpoint's limit point.
 11. A method, comprising: converting a subdivision face containing an extraordinary point to a Bezier patch defined by Bezier control points; and adjusting a Bezier control point to improve the conversion.
 12. A method, comprising: converting a subdivision face with a creased edge to a Bezier patch defined by Bezier control points; and adjusting a Bezier control point to improve the conversion.
 13. A computer readable storage, controlling a computer by, converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point.
 14. A computer readable storage as recited in claim 14, further comprising: adjusting affected Bezier control points which are affected by using the dummy value to better fit a Bezier patch defined by the Bezier control points with a limit surface of the subdivision face.
 15. An apparatus, comprising: a converting module converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and a replacing module replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point.
 16. An apparatus as recited in claim 15, further comprising: an adjusting module adjusting affected Bezier control points which are affected by using the dummy value to better fit a Bezier patch defined by the Bezier control points with a limit surface of the subdivision face.
 17. An apparatus, comprising: means for converting a subdivision face to Bezier control points using a conversion matrix using fifteen points and a dummy value for an unavailable sixteenth point; and means for replacing one of the Bezier control points which corresponds to an extraordinary point on the subdivision face with the extraordinary point's limit point.
 18. An apparatus as recited in claim 17, further comprising: means for adjusting affected Bezier control points which are affected by using the dummy value to better fit a Bezier patch defined by the Bezier control points with a limit surface of the subdivision face. 